On Minimal Tree Realizations of Linear Codes
نویسندگان
چکیده
منابع مشابه
On Minimal and Almost-Minimal Linear Codes
Minimal linear codes are such that the support of every codeword does not contain the support of another linearly independent codeword. Such codes have applications in cryptography, e.g. to secret sharing and secure two-party computations. We pursue here the study of minimal codes and construct infinite families with asymptotically non-zero rates. We also introduce a relaxation to almost minima...
متن کاملVariations on Minimal Linear Codes
Minimal linear codes are linear codes such that the support of every codeword does not contain the support of another linearly independent codeword. Such codes have applications in cryptography, e.g. to secret sharing. We pursue here their study and construct asymptotically good families of minimal linear codes. We also push further the study of quasi-minimal and almost-minimal linear codes, re...
متن کاملon the effect of linear & non-linear texts on students comprehension and recalling
چکیده ندارد.
15 صفحه اولBounds on Minimal Codewords in Linear Codes
The notion of minimal codewords in linear codes was introduced recently by Massey. In this paper two weight bounds on minimal code-words are proved; an upper bound above which no codewords are minimal and a lower bound below which all codewords are minimal. It is shown for Hamming codes that every weight class between the two bounds contains at least one minimal codeword and at least one non-mi...
متن کاملOn Minimal Realizations and Minimal Partial Realizations of Linear Time-Invariant Systems Subject to Point Incommensurate Delays
This paper investigates key aspects of realization and partial realization theories for linear timeinvariant systems being subject to a set of incommensurate internal and external point delays. The results are obtained based on the use of formal Laurent expansions whose coefficients are polynomial matrices of appropriate orders and which are also appropriately related to truncated and infinite ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2009
ISSN: 0018-9448
DOI: 10.1109/tit.2009.2023718